Continuous-time shortest path problems with stopping and starting costs
نویسندگان
چکیده
منابع مشابه
Continuous-time Shortest Path Problems with Stopping and Starting Costs
We describe a general solution method for the problem of finding the shortest path between two vertices of a graph in which each edge has some transit time, costs can vary with time, and stopping and parking (with corresponding costs) are allowed at the vertices.
متن کاملRobust shortest path problems with uncertain costs
Data coming from real-world applications are very often affected by uncertainty. On the other hand, it is difficult to translate uncertainty in terms of combinatorial optimization. In this paper we study a combinatorial optimization model to deal with uncertainty in arc costs in shortest path problems. We consider a model where feasible arc cost scenarios are described via a convex polytope. We...
متن کاملTime-varying shortest path problems with constraints
The shortest path problem is considered with yet another extension. The transit times b(x,y,u) and the arc costs c(x,y,u) on arc (x,y) vary as a function of the departure time u at the beginning vertex of the arc. The problem considered is to find the shortest path between a pair of nodes such that the total traverse time is lesser than some specified value T. Waiting times at nodes are conside...
متن کاملContinuous-Time Dynamic Shortest Path Algorithms
We consider the problem of computing shortest paths through a dynamic network – a network with time-varying characteristics, such as arc travel times and costs, which are known for all values of time. Many types of networks, most notably transportation networks, exhibit such predictable dynamic behavior over the course of time. Dynamic shortest path problems are currently solved in practice by ...
متن کاملFinding Risk-Averse Shortest Path with Time-Dependent Stochastic Costs
In this paper, we tackle the problem of risk-averse route planning in a transportation network with time-dependent and stochastic costs. To solve this problem, we propose an adaptation of the A* algorithm that accommodates any risk measure or decision criterion that is monotonic with first-order stochastic dominance. We also present a case study of our algorithm on the Manhattan, NYC, transport...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 1992
ISSN: 0893-9659
DOI: 10.1016/0893-9659(92)90066-i